A New Algori m for Computing Theory mplicates Compilations
نویسندگان
چکیده
We present a new algorithm (called TPI /BDD) for computing the theory prime implicates compilation of a knowledge base X. In contrast to many compilation algorithms, TPI /BDD does not require the prime implicates of Z to be generated. Since their number can easily be exponential in the size of X, TPI/BDD can save a lot of computing. Thanks to TPI/BDD, we can now conceive of compiling knowledge bases impossible to before.
منابع مشابه
Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملThree New Systematic Approaches for Computing Heffron-Phillips Multi-Machine Model Coefficients (RESEARCH NOTE)
This paper presents three new systematic approaches for computing coefficient matrices of the Heffron-Phillips multi-machine model (K1, …, K6). The amount of computations needed for conventional and three new approaches are compared by counting number of multiplications and divisions. The advantages of new approaches are: (1) their computation burdens are less than 73 percent of that of convent...
متن کاملA New Model Representation for Road Mapping in Emerging Sciences: A Case Study on Roadmap of Quantum Computing
One of the solutions for organizations to succeed in highly competitive markets is to move toward emerging sciences. These areas provide many opportunities, but, if organizations do not meet requirements of emerging sciences, they may fail and eventually, may enter a crisis. In this matter, one of the important requirements is to develop suitable roadmaps in variety fields such as strategic, ca...
متن کاملParallel and Distributed Systems for Constructive Neural Network Learning
A construct ive learning algori thm dynamical ly creates a problem-specific neural ne twork architecture rather t h a n learning o n a pre-specified architecture. W e propose a parallel vers ion of our recently presented construct ive neural ne twork learning algori thm. Parallelization provides a computat ional speedup by a fact o r of O ( t ) where t is t h e number of training ezamples. Dist...
متن کاملComputing local coefficients via types and covers: the example of $SL(2)$
We illustrate a method of computing Langlands-Shahidi local coefficients via the theory of types and covers. The purpose of this paper is to illustrate a method of computing the Langlands-Shahidi local coefficients using the theory of types and covers.
متن کامل